Nondeterministic Streaming String Transducers

We introduce nondeterministic streaming string transducers (NSSTs) { a new computational model that can implement MSO-definable relations between strings. An NSST makes a single left-to-right pass on the input string and uses a finite set of string variables to compute the output. In each step, it reads one input symbol, and updates its string variables in parallel with a copyless assignment.We show that the expressive power of NSST coincides with that of nondeterministic MSO-definable transductions. Further, we identify the class of functional NSST; these allow nondeterministic transitions, but for every successful run on a given input generates the same output string. We show that deciding functionality of an arbitrary NSST is decidable with PSPACE complexity, while the equivalence problem for functional NSST is PSPACE-complete. We also show that checking if the set of outputs of an NSST is contained within the set of outputs of a finite number of DSSTs is decidable in PSPACE. Disciplines Computer Sciences Comments From the 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011. This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/cis_papers/570 Nondeterministic Streaming String Transducers Rajeev Alur and Jyotirmoy V. Deshmukh Dept. of Computer and Information Science, University of Pennsylvania. {alur,djy}@cis.upenn.edu Abstract. We introduce nondeterministic streaming string transducers We introduce nondeterministic streaming string transducers (nssts) – a new computational model that can implement MSO-definable relations between strings. An nsst makes a single left-to-right pass on the input string and uses a finite set of string variables to compute the output. In each step, it reads one input symbol, and updates its string variables in parallel with a copyless assignment. We show that the expressive power of nsst coincides with that of nondeterministic MSO-definable transductions. Further, we identify the class of functional nsst; these allow nondeterministic transitions, but for every successful run on a given input generates the same output string. We show that deciding functionality of an arbitrary nsst is decidable with pspace complexity, while the equivalence problem for functional nsst is pspace-complete. We also show that checking if the set of outputs of an nsst is contained within the set of outputs of a finite number of dssts is decidable in pspace.